An approximation algorithm for scheduling dependent tasks on m processors with small communication delays
نویسندگان
چکیده
منابع مشابه
An approximation algorithm for scheduling dependent tasks on m processors with small communication delays
This paper de nes and studies an approximation algorithm for scheduling tasks with small communication delays onm processors. In a rst step, a schedule 1 for the problem instance with an unlimited number of processors is generated with a polynomial algorithm with relative performance bounded by 2(1 + ) 2 + , where denotes the ratio between the greatest communication delay and the smallest proce...
متن کاملScheduling Tasks with Communication Delays on Parallel Processors
Let Jn={v1,...,vn} be a set of n jobs to be executed and E a set of precedence constraints on Jn. Assume that we have available a set Mk={m1,...,mk} of k identical machines that are to execute the jobs in Jn such that the time needed by any machine to execute each job in Jn is one unit. Our main result in this paper is to give an O(n log2(n)) algorithm to find an optimal scheduling with communi...
متن کاملUsing Duplication for Scheduling Unitary Tasks on m Processors with Unit Communication Delays
This paper introduces a new list scheduling algorithm that uses greedy duplication to solve a scheduling problem with communication delays and resource
متن کاملScheduling Complete Intrees on Two Uniform Processors with Communication Delays
In this paper we present an optimal algorithm for scheduling complete k-ary tree on two uniform processors of di erent speeds in order to minimize schedule length. We consider the basic case of unit standard execution times and unit communication times.
متن کاملScheduling UET Trees with Communication Delays on two Processors
In this paper, we present a new linear time algorithm for scheduling uect (Unit Execution and Communication Time) trees on two identical processors: CBoS (clusters based on subtrees). The chosen criterion is the makespan. The used strategy is based on clustering of tasks. We show that this algorithm builds optimal schedules. Some extensions are discussed for non uet tasks. Nous pr esentons un n...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 2001
ISSN: 0166-218X
DOI: 10.1016/s0166-218x(00)00179-7